Cyclic distance-preserving codes on a constant-weight basis

Some new distance-4 constant weight codes

Improved binary constant weight codes with minimum distance 4 and length at most 28 are constructed. A table with bounds on the chromatic number of small Johnson graphs is given.

On the Grobner Basis of a Family of Quasi-Cyclic LDPC Codes

On Equidistant Constant Weight Codes

Equidistant constant weight codes are studied in this paper. The dual distance distribution of equidistant constant weight codes is investigated and used to obtain upper bounds on the size of such codes as well as equidistant codes in general. ? 2003 Elsevier Science B.V. All rights reserved.

A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...

On a Class of Constant Weight Codes

For any odd prime power q we first construct a certain non-linear binary code C(q, 2) having (q − q)/2 codewords of length q and weight (q − 1)/2 each, for which the Hamming distance between any two distinct codewords is in the range [q/2 − 3√q/2, q/2 + 3√q/2] that is, ‘almost constant’. Moreover, we prove that C(q, 2) is distance-invariant. Several variations and improvements on this theme are...